Does Diploidy A ect Evolutions of Hop eld Associative Memory ?
نویسنده
چکیده
We apply genetic algorithms to the Hop eld's neural network model of associative memory. Previously, we observed that random synaptic weights of a network evolved to create the xed point attractors corresponding to a set of given patterns to be stored. In that simulation, a weight con guration was expressed as a sequence of genes which might be called a haploid chromosome. Then a population of these haploid chromosomes underwent evolution. In this paper, we employ diploid chromosomes, a pair of chromosomes. We have reported elsewhere two di erent versions of the evolution that uses diploid chromosomes. One is the evolution of the Hebbian synapses in which some of the synapses are adaptively pruned according to information in the diploid chromosomes. The other is the evolution of real-valued random synaptic weights which are encoded directly into diploid chromosomes. Here, we describe the evolution based on the latter scheme with the weights being restricted to take the value 1. keywords Hop eld model of associative memory, genetic algorithm, diploid chromosome.
منابع مشابه
The Baldwin E ect on the Evolution of Associative Memory
|We apply genetic algorithms to the Hop eld model of associative memory. Previously, we reported that a genetic algorithm evolves a network with random synaptic weights to store eventually a set of random patterns. In this paper, we present the Baldwin e ect on the evolution enhances the storage capacity.
متن کاملSearching Real-Valued Synaptic Weights of Hopfield's Associative Memory Using Evolutionary Programming
We apply evolutionary computations to Hop eld model of associative memory. Although there have been a lot of researches which apply evolutionary techniques to layered neural networks, their applications to Hop eld neural networks remain few so far. Previously we reported that a genetic algorithm using discrete encoding chromosomes evolves the Hebb-rule associative memory to enhance its storage ...
متن کاملGenetic Algorithm Enlarges the Capacity of Associative Memory
We propose a genetic algorithm for mutually connected neural networks to obtain a higher capacity of associative memory. In Hop eld network as an associative memory system, the memory capacity is at most 15% of the number of neurons. Here we applied our method to the Hop eld network, and obtained the capacity of 33%. We conjectured that this is due to both asymmetry and sparseness of the connec...
متن کاملEvolution of a Hop eld Associative Memory by the Breeder Genetic Algorithm
We apply some variants of evolutionary computations to the Hop eld model of associative memory. In this paper, we use the Breeder Genetic Algorithm (BGA) to explore the optimal set of synaptic weights with respect to the storage capacity. We present the BGA has tremendous ability to search a solution in the massively multi-modal landscape of the synaptic weight space. The main goal of this stud...
متن کاملHop eld Model of Associative Memory as a Test Function of Evolutionary Computations
We apply genetic algorithms to Hop eld's neural network model of associative memory. Previously, using ternary chromosomes, we successfully evolved both random weight matrix and over-loaded Hebbian weight matrix to function as an associative memory. In this paper, we present a real-encoded genetic algorithm to evolve random synaptic weights to store some number of patterns as associative memory...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007